Systematic Literature Review Robust Graph Coloring on Electric Circuit Problems

Graph Coloring Problem (GCP) is the assignment of colors to certain elements in a graph based on constraints. GCP used by assigning color label each node with neighboring nodes assigned different and minimum number used. Based this, can be drawn into an optimization problem that minimize Optimization problems coloring occur due uncertainty use used, so it assumed there colored vertices. One mathematical methods presence Robust (RO). RO modeling methodology combined computational tools process uncertain data only some for which certainty known. This paper will review research model validation applied electrical circuit using systematic literature. A literature was carried out Preferred Reporting Items Systematic reviews Meta Analysis (PRISMA) method. The keywords this study were search articles related database. results obtained from PRISMA Bibliometric R Software, found relationship between Coloring, means at least one researcher who has studied problem. However, Electricity keyword no relation other two keywords, gap possible if not been discussed researchers. study, hoped as consideration better solution solve problems.